Rainbow Arithmetic Progressions

نویسندگان

  • Steve Butler
  • Craig Erickson
  • Leslie Hogben
  • Kirsten Hogenson
  • Lucas Kramer
  • Richard L. Kramer
  • Jephian Chin-Hung Lin
  • Ryan R. Martin
  • Derrick Stolee
  • Nathan Warnberg
  • Michael Young
چکیده

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers n and k, the expression aw([n], k) denotes the smallest number of colors with which the integers {1, . . . , n} can be colored and still guarantee there is a rainbow arithmetic progression of length k. We establish that aw([n], 3) = Θ(log n) and aw([n], k) = n1−o(1) for k ≥ 4. For positive integers n and k, the expression aw(Zn, k) denotes the smallest number of colors with which elements of the cyclic group of order n can be colored and still guarantee there is a rainbow arithmetic progression of length k. In this setting, arithmetic progressions can “wrap around,” and aw(Zn, 3) behaves quite differently from aw([n], 3), depending on the divisibility of n. As shown in [Jungić et al., Combin. Probab. Comput., 2003], aw(Z2m , 3) = 3 for any positive integer m. We establish that aw(Zn, 3) can be computed from knowledge of aw(Zp, 3) for all of the prime factors p of n. However, for k ≥ 4, the behavior is similar to the previous case, that is, aw(Zn, k) = n1−o(1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On rainbow 4-term arithmetic progressions

{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...

متن کامل

Rainbow Ramsey Theory

This paper presents an overview of the current state in research directions in the rainbow Ramsey theory. We list results, problems, and conjectures related to existence of rainbow arithmetic progressions in [n] and N. A general perspective on other rainbow Ramsey type problems is given.

متن کامل

Rainbow 3-term Arithmetic Progressions

Consider a coloring of {1, 2, . . . , n} in 3 colors, where n ≡ 0 (mod 3). If all the color classes have the same cardinality, then there is a 3-term arithmetic progression whose elements are colored in distinct colors. This rainbow variant of van der Waerden’s theorem proves the conjecture of the second author.

متن کامل

Rainbow Arithmetic Progressions and Anti-Ramsey Results

The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distin...

متن کامل

On Rainbow Arithmetic Progressions

Consider natural numbers {1, · · · , n} colored in three colors. We prove that if each color appears on at least (n + 4)/6 numbers then there is a three-term arithmetic progression whose elements are colored in distinct colors. This variation on the theme of Van der Waerden’s theorem proves the conjecture of Jungić et al.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014